# # # # 输入处理
# # # nums = []
# # # input_str = input().split()
# # # for s in input_str:
# # #     nums.append(int(s))
# # #
# # # # 初始化极值
# # # max_val = nums[0]
# # # min_val = nums[0]
# # # max_index = 0
# # # min_index = 0
# # #
# # # # 遍历查找极值
# # # for i in range(1, len(nums)):
# # #     # 检查最大值
# # #     if nums[i] > max_val:
# # #         max_val = nums[i]
# # #         max_index = i
# # #     # 检查最小值
# # #     if nums[i] < min_val:
# # #         min_val = nums[i]
# # #         min_index = i
# # #
# # # # 输出结果
# # # print(f"{max_val} {max_index}")
# # # print(f"{min_val} {min_index}")
# # def prefix(s1, s2):
# #   """
# #   检查两个字符串是否有共有前缀，如果有，返回该共有前缀;否则返回None。
# #   """
# #   min_len = min(len(s1), len(s2))
# #   common_prefix = ""
# #   for i in range(min_len):
# #     if s1[i] == s2[i]:
# #       common_prefix += s1[i]
# #     else:
# #       break
# #   if common_prefix:
# #     return common_prefix
# #   else:
# #     return None
# #
# # # 获取输入
# # str1 = input()
# # str2 = input()
# #
# # # 调用函数并输出结果
# # result = prefix(str1, str2)
# # if result:
# #   print(result)
# # else:
# #   print("No common prefix")
#
# def isPalindrome(n):
#   """
#   判断一个整数是否是回文整数。
#   """
#   s = str(n)
#   return s == s[::-1]  # 使用切片[::-1]来反转字符串并进行比较
#
# def main():
#   """
#   主函数，读取输入，调用isPalindrome函数，并输出结果。
#   """
#   n = int(input())
#   if isPalindrome(n):
#     print("True")
#   else:
#     print("False")
# main()
x=0
# for y in range(30,1,-3):
#     print(y)
#     y+=1
# for n in [(1,2,3,4,5,6, 7,8, 9, 10)]:
#     print(x)
#     x+=1
# for n,m in {'A' :100,'B' :90,'c ':80, 'D':70,'E ':60 }.items():
#     print(x)
print(3//2)

